Finite automata - PDFSEARCH.IO - Document Search Engine

Finite automata
Results: 673

#	Item
271	Invariants for equivalence of finite automata Mike Spivey Let S = (S, Σ, δS , s0 , FS ) and T = (T , Σ, δT , t0 , FT ) be two deterministic finite automata with the same alphabet Σ. We say S and T are equivalent if, Add to Reading List Source URL: spivey.oriel.ox.ac.uk Language: English - Date: 2010-02-09 12:35:41 Equivalence relation Structure Deterministic finite automaton If and only if Complementation of Büchi automaton Finite state transducer Automata theory Mathematics Models of computation
272	A Type System for Expressive Security Policies∗ David Walker Cornell University abstraction preservation (programs use abstract data types only as their interfaces allow). These properties Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 1999-04-16 16:28:29 Mathematics Logic First-order logic Interpretation Symbol Functional predicate Type safety Function Nondeterministic finite automaton Mathematical logic Automata theory Model theory
273	Combining Static Model Checking with Dynamic Enforcement using the Statecall Policy Language Anil Madhavapeddy Imperial College, South Kensington, London SW1 2AZ, UK [removed] Add to Reading List Source URL: anil.recoil.org Language: English - Date: 2013-09-29 14:14:18 Computing Programming language theory Promela Finite-state machine ALGOL 68 Software engineering Automata theory Models of computation
274	Optimization of Massive Pattern Queries by Dynamic Configuration Morphing Nikolay Laptev #1 , Carlo Zaniolo #2 # University of California, Los Angeles Add to Reading List Source URL: labs.yahoo.com Language: English - Date: 2015-02-04 18:38:47 Formal languages Computer science Applied mathematics Pattern matching Regular expressions Nondeterministic finite automaton Deterministic finite automaton Nested word Finite-state machine Automata theory Models of computation Theoretical computer science
275	Automata theory Regular Cost Functions Contributions of the thesis Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2013-05-09 10:09:21 Computability theory Theory of computation Automata theory Models of computation Church–Turing thesis Algorithm Decidability Finite-state machine P Theoretical computer science Computer science Applied mathematics
276	Quasi-Weak Cost Automata A New Variant of Weakness Denis Kuperberg1 1 LIAFA/CNRS/Universit´ e 2 Department Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2012-10-25 13:52:50 Computer science Applied mathematics Mathematics Nondeterministic finite automaton Regular language Finite-state machine Ω-automaton Automata theory Formal languages Models of computation
277	Expressive power of Cost Logics over Infinite Words Denis Kuperberg and Michael Vanden Boom S´eminaire Automates Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2012-10-25 13:52:50 Computer science Applied mathematics Mathematics Regular language Nondeterministic finite automaton Finite-state machine Ω-automaton Omega-regular language Automata theory Formal languages Models of computation
278	Nondeterminism in the Presence of a Diverse or Unknown Future ? Udi Boker1 , Denis Kuperberg2 , Orna Kupferman2 , and Michał Skrzypczak3 1 2 Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2013-04-29 05:18:08 Applied mathematics Ω-automaton Muller automaton Büchi automaton Tree automaton Finite-state machine Regular language Formal language Tree Automata theory Theoretical computer science Computer science
279	Séminaire de Sûreté de Fonctionnement de l’X Guarded Transitions Systems Antoine Rauzy École Polytechnique Add to Reading List Source URL: altarica.fr Language: English - Date: 2013-08-01 09:29:48 Software engineering Concurrency Automata theory Diagrams Petri net Markov chain Model checking Fault tree analysis Finite-state machine Models of computation Systems engineering Statistics
280	An AI Modeling Tool for Designers and Developers Dan Fu, Ryan Houlette, and Jeremy Ludwig Stottler Henke Associates, Inc. 951 Mariners Island Blvd, Suite 360 San Mateo, CA 94404 {fu, houlette, ludwig}@stottlerhenke.com Add to Reading List Source URL: www.stottlerhenke.com Language: English - Date: 2008-01-19 05:59:59 Behavior Human behavior Automated planning and scheduling Reactive planning Finite-state machine Application programming interface Intelligent tutoring system Action Education Automata theory Digital electronics Models of computation

UPDATE